A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line
نویسندگان
چکیده
In this article, we will study the link between a method for computing eigenvalues closest to the imaginary axis and the implicitly restarted Arnoldi method. The extension to eigenvalues closest to a vertical line is straightforward, by incorporating a shift. Without loss of generality we will restrict ourselves here to the imaginary axis. In a recent publication, Meerbergen and Spence discussed a new approach for detecting purely imaginary eigenvalues corresponding to Hopf bifurcations. The proposed method is based on inverse iteration (inverse power method) on a Lyapunov like eigenvalue problem. A projection step was added that significantly reduces the computational overhead. The same method can be used for computing eigenvalues of a matrix pencil near a vertical line in the complex plane. This method then appears to be equivalent with Sorensen’s implicitly restarted Arnoldi method with a special choice of shifts.
منابع مشابه
Implicitly Restarted Arnoldi Methods and Eigenvalues of the Discretized Navier Stokes Equations
Implicitly restarted Arnoldi methods and eigenvalues of the discretized Navier Stokes equations. Abstract We are concerned with nding a few eigenvalues of the large sparse nonsymmetric generalized eigenvalue problem Ax = Bx that arises in stability studies of incompressible uid ow. The matrices have a block structure that is typical of mixed nite-element discretizations for such problems. We ex...
متن کاملA Harmonic Restarted Arnoldi Algorithm for Calculating Eigenvalues and Determining Multiplicity
A restarted Arnoldi algorithm is given that computes eigenvalues and eigenvectors. It is related to implicitly restarted Arnoldi, but has a simpler restarting approach. Harmonic and regular RayleighRitz versions are possible. For multiple eigenvalues, an approach is proposed that first computes eigenvalues with the new harmonic restarted Arnoldi algorithm, then uses random restarts to determine...
متن کاملSome new restart vectors for explicitly restarted Arnoldi method
The explicitly restarted Arnoldi method (ERAM) can be used to find some eigenvalues of large and sparse matrices. However, it has been shown that even this method may fail to converge. In this paper, we present two new methods to accelerate the convergence of ERAM algorithm. In these methods, we apply two strategies for the updated initial vector in each restart cycles. The implementation of th...
متن کاملArnoldi-Faber method for large non hermitian eigenvalue problems
We propose a restarted Arnoldi’s method with Faber polynomials and discuss its use for computing the rightmost eigenvalues of large non hermitian matrices. We illustrate, with the help of some practical test problems, the benefit obtained from the Faber acceleration by comparing this method with the Chebyshev based acceleration. A comparison with the implicitly restarted Arnoldi method is also ...
متن کاملA semiorthogonal generalized Arnoldi method and its variations for quadratic eigenvalue problems
In this paper, we are concerned with the computation of a few eigenpairs with smallest eigenvalues in absolute value of quadratic eigenvalue problems. We first develop a semiorthogonal generalized Arnoldi method where the name comes from the application of a pseudo inner product in the construction of a generalized Arnoldi reduction [25] for a generalized eigenvalue problem. The method applies ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010